v 1 [ nl in . C G ] 4 O ct 2 00 6 Coalescing Cellular Automata
نویسنده
چکیده
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both configurations become identical after a reasonable time. We prove coalescence for two elementary rules and show that there exists infinitely many coalescing CA. We then conduct an experimental study on all elementary CA and show that some rules exhibit a phase transition, which belongs to the universality class of directed percolation.
منابع مشابه
ar X iv : c s / 06 08 12 0 v 2 [ cs . G T ] 3 0 O ct 2 00 6 Controller synthesis & Ordinal Automata
Ordinal automata are used to model physical systems with Zeno behavior. Using automata and games techniques we solve a control problem formulated and left open by Demri and Nowak in 2005. It involves partial observability and a new synchronization between the controller and the environment.
متن کاملar X iv : c s / 06 10 16 6 v 1 [ cs . G T ] 3 0 O ct 2 00 6 Tree Automata Make Ordinal Theory Easy
We give a new simple proof of the decidability of the First Order Theory of (ω i ,+) and the Monadic Second Order Theory of (ω, <), improving the complexity in both cases. Our algorithm is based on tree automata and a new representation of (sets of) ordinals by (infinite) trees.
متن کاملar X iv : n lin / 0 50 20 61 v 1 [ nl in . C G ] 2 6 Fe b 20 05 Two Cellular Automata for the 3 x + 1 Map
Two simple Cellular Automata, which mimic the Collatz-Ulam iterated map (3x + 1 map), are introduced. These Cellular Automata allow to test efficiently the Collatz conjecture for very large numbers.
متن کاملar X iv : n lin . C G / 0 10 20 26 v 2 3 M ay 2 00 1 Parity Problem With A Cellular Automaton Solution
The parity of a bit string of length N is a global quantity that can be efficiently compute using a global counter in O(N) time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of r = 1 binary, uniform, parallel and deterministic cellular automata applied in...
متن کامل